منابع مشابه
Throwing a MonkeyWrench into Web Attackers Plans
Client-based attacks on internet users with malicious web pages represent a serious and rising threat. Internet Browsers with enabled active content technologies such as JavaScript are vulnerable to so-called drive-by downloads. Drive-by downloads are able to automatically infect a victim's system during a single visit of a crafted web page testing various vulnerabilities and installing e.g. ma...
متن کاملMyosin shifts into reverse gear.
213 news & views time to useful timescales. By manipulating the ratio of these modified monomers, Rant and co-workers created nanopores that contained only a single nitrilotriacetic acid group within the sensing zone of the nanopore, which could be used to detect the reversible binding of single proteins. In another part of the study, Rant and colleagues functionalized a nanopore with three nit...
متن کاملShifting Expression Procedures into Reverse
The best known approach to program transformation is the unfold fold methodology of Burstall and Darlington a sim ple intuitive and expressive approach which serves as the basis of many automatic program transformation algorithms such as partial evaluation and deforestation Unfortu nately unfold fold does not preserve total correctness and requires maintaining a transformation history of the pr...
متن کاملProgram Development Tools: Debugging by Reverse Computing
More and more program development tools have turned to Web-based. It has an advantage on being a multiplatform tool. This work proposes a debugging tool based on web interface. The main idea of the tool is that the execution of the program can be regarded as a flow. This flow can be captured and played back later. Therefore, any state of the executed program can be analyzed and errors can be pi...
متن کاملEfficient Computing of Longest Previous Reverse Factors
We study the problem of finding the longest previous reverse factor occurring at each position of a string. This is a generalisation of a notion used for the optimal detection of various types of palindromes in a string. We describe two algorithms for computing the LPrF table of a string, one from its Suffix Tree and the second from its Suffix Automaton respectively. These algorithms run in lin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Spectrum
سال: 2017
ISSN: 0018-9235
DOI: 10.1109/mspec.2017.8012237